Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
211	Title: Introduction to the Dynamic Games Special Issue Authors: David K. Levine, Department of Economics UCLA Los Angeles, CA[removed]phone/fax[removed] Add to Reading List Source URL: www.dklevine.com Language: English - Date: 2000-09-09 00:51:21 David K. Levine Academia Nash equilibrium Fictitious play Subgame perfect equilibrium Repeated game Review of Economic Dynamics Game theory Economics Problem solving
212	DENSITY-INDEPENDENT, SCALABLE SEARCH IN AD HOC NETWORKS Zygmunt J. Haas and Rimon Barr Wireless Networks Laboratory Cornell University Ithaca, NY 14850, U.S.A Add to Reading List Source URL: jist.ece.cornell.edu Language: English - Date: 2013-12-04 22:11:14 OSI protocols Zone Routing Protocol Link-state routing protocol Dynamic Source Routing Optimized Link State Routing Protocol Ad hoc On-Demand Distance Vector Routing Routing Wireless ad-hoc network Hidden node problem Wireless networking Technology Network architecture
213	FCPM: Problem Description New Algorithms on Compressed Texts Fully Compressed Pattern Matching (FCPM) INPUT: Compressed strings P and T OUTPUT: Yes/No (whether P is a substring in T ?) Add to Reading List Source URL: yury.name Language: English - Date: 2006-03-17 20:59:12 Dynamic programming Pattern matching Data compression Mathematical optimization String Substring Compressed pattern matching Longest common subsequence problem Yuri Matiyasevich Mathematics Theoretical computer science Applied mathematics
214	22nd National Conference of the Australian Society for Operations Research, Adelaide, Australia, 1–6 December 2013 www.asor.org.au/conferences/asor2013 Dynamic Morphological Exploration Peter B Williamsa and Fred DJ Bo Add to Reading List Source URL: www.asor.org.au Language: English - Date: 2013-11-24 18:45:38 Morphological analysis Ethology Grammar Anticipatory thinking Environmental economics Prediction Wicked problem Morphology Decision support system Creativity Science Time
215	COMS21103 Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications: Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:07 Network flow Operations research Routing algorithms Network theory Bellman–Ford algorithm Shortest path problem Dynamic programming Induced path Maximum flow problem Mathematics Graph theory Theoretical computer science
216	The Systematic Component of Monetary Policy in SVARs: An Agnostic Identification Procedure Add to Reading List Source URL: www.federalreserve.gov Language: English - Date: 2015-03-20 11:27:15 Econometrics New classical macroeconomics Economic theories Monetary policy Macroeconomic policy Vector autoregression Dynamic stochastic general equilibrium Economic model Parameter identification problem Macroeconomics Economics Statistics
217	Y:/workspace/work/research/papers/icra11[removed]paper.dvi Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2011-10-14 01:37:09 Operations research Dynamic programming Routing algorithms Finite fields Optimal control XTR Sensor Shortest path problem Floyd–Warshall algorithm Mathematics Theoretical computer science Applied mathematics
218	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗ Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2008-10-07 16:38:22 Theoretical computer science Mathematical optimization Network theory Operations research Motion planning Shortest path problem Visibility graph Dynamic programming Pareto efficiency Mathematics Applied mathematics Graph theory
219	Project Zero sheds more light on rowhammer problem Add to Reading List Source URL: phys.org Language: English - Date: 2015-04-17 04:20:48 Dynamic random-access memory Memory controller Random-access memory DDR4 SDRAM Computer data storage Computer memory Computer hardware Computing
220	Better Be Lucky Than Good: Exceeding Expectations in MDP Evaluation Thomas Keller and Florian Geißer University of Freiburg Freiburg, Germany {tkeller,geisserf}@informatik.uni-freiburg.de Add to Reading List Source URL: gki.informatik.uni-freiburg.de Language: English - Date: 2015-03-07 08:48:57 Dynamic programming Stochastic control Markov decision process Reinforcement learning Markov chain Valuation Secretary problem Statistics Markov processes Markov models

UPDATE